A Framework for Describing Block Cipher Cryptanalysis
نویسندگان
چکیده
منابع مشابه
Cryptanalysis of TWIS Block Cipher
TWIS is a 128-bit lightweight block cipher that is proposed by Ojha et al. In this work, we analyze the security of the cipher against differential, impossible differential and linear attacks. For the differential case, we mount a full-round attack on TWIS and recover 12 bits of the 32-bit final subkey with 2 complexity. For the other cases, we present distinguishers which can be extended to ke...
متن کاملNovel Impossible Differential Cryptanalysis of Zorro Block Cipher
Impossible difference attack is a powerful tool for evaluating the security of block ciphers based on finding a differential characteristic with the probability of exactly zero. The linear layer diffusion rate of a cipher plays a fundamental role in the security of the algorithm against the impossible difference attack. In this paper, we show an efficient method, which is independent of the qua...
متن کاملImpossible Differential Cryptanalysis for Block Cipher Structures
Impossible Differential Cryptanalysis(IDC) [4] uses impossible differential characteristics to retrieve a subkey material for the first or the last several rounds of block ciphers. Thus, the security of a block cipher against IDC can be evaluated by impossible differential characteristics. In this paper, we study impossible differential characteristics of block cipher structures whose round fun...
متن کاملCryptanalysis of Reduced-Round Midori64 Block Cipher
Midori is a hardware-oriented lightweight block cipher designed by Banik et al. in ASIACRYPT 2015. It has two versions according to the state sizes, i.e. Midori64 and Midori128. In this paper, we explore the security of Midori64 against truncated differential and related-key differential attacks. By studying the compact representation of Midori64, we get the branching distribution properties of...
متن کاملImproved Linear Cryptanalysis of SMS4 Block Cipher
SMS4 is a block cipher standard used for wireless communications in China. We analyze a reduced versions of SMS4 by the multidimensional linear cryptanalysis method. Our analysis shows that the 23-round of SMS4 can be attacked with 2 data complexity and time complexity less than exhaustive search.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2006
ISSN: 0018-9340
DOI: 10.1109/tc.2006.169